RFC 9299 An Architectural Introduction to the Locator/ID Separation Protocol (LISP)

IETFThis document describes the architecture of the Locator/ID Separation Protocol (LISP), making it easier to read the rest of the LISP specifications and providing a basis for discussion about the details of the LISP protocols. This document is used for introductory purposes; more details can be found in the protocol specifications, RFCs 9300 and 9301

Efficient caching in content-centric networks using OpenFlow

International audienceContent-Centric Networking (CCN) is designed for efficient content dissemination and supports caching contents on the path from content providers to content consumers to improve user experience and reduce costs. However, this strategy is not optimal inside a domain. In this paper, we propose a solution to improve caching in CCN using a Software-Defined Networking approach

Distributed Privacy Preserving Platform for Ridesharing Services

International audienceThe sharing economy fundamentally changed business and social interactions. Interestingly, while in essence this form of collabora-tive economy allows people to directly interact with each other, it is also at the source of the advent of eminently centralized platforms and marketplaces , such as Uber and Airbnb. One may be concerned with the risk of giving the control of a market to a handful of actors that may unilaterally fix their own rules and threaten privacy. In this paper, we propose a decentralized ridesharing architecture which gives the opportunity to shift from centralized platforms to decentralized ones. Digital communications in our proposition are specifically designed to preserve data privacy and avoid any form of centralization. We integrate a blockchain in our proposition to guarantee the essential roles of a marketplace, but in a decentralized way. Our numerical evaluation quantifies the advantages and limits of decentralization and our Android implementation shows the feasibility of our proposition

Distributed Privacy Preserving Platform for Ridesharing Services

The sharing economy fundamentally changed business and social interactions. Interestingly, while in essence this form of collaborative economy allows people to directly interact with each other, it is also at the source of the advent of eminently centralized platforms and marketplaces, such as Uber and Airbnb. One may be concerned with the risk of giving the control of a market to a handful of actors that may unilaterally fix their own rules and threaten privacy. In this paper, we propose a decentralized ridesharing architecture which gives the opportunity to shift from centralized platforms to decentralized ones. Digital communications in our proposition are specifically designed to preserve data privacy and avoid any form of centralization. We integrate a blockchain in our proposition to guarantee the essential roles of a marketplace, but in a decentralized way. Our numerical evaluation quantifies the advantages and limits of decentralization

Validation of a LISP simulator

We have developed a LISP simulator (CoreSim). CoreSim is an Internet-scale LISP deployment simulator. It is able to replay a packet trace and simulate the behavior of a LISP Ingress Tunnel Router (ITR) and the associated Mapping Resolver, on top of a topology based on measurements performed by the iPlane infrastructure. It reports mapping lookup latency, the load imposed on each node of the MS and cache performance statistics. The simulator implements LISP-ALT and LISP-DHT. In this technical report we validate our LISP-DHT implementation, present an estimator for the latencies not reported by iPlane and discuss the architecture of CoreSim.Preprin

An Availability-aware SFC placement Algorithm for Fat-Tree Data Centers

Complex inter-connections of virtual functions form the so-called Service Function Chains (SFCs) deployed in the Cloud. Such service chains are used for critical services like e-health or autonomous transportation systems and thus require high availability. Respecting some availability level is hard in general, but it becomes even harder if the operator of the service is not aware of the physical infrastructure that will support the service, which is the case when SFCs are deployed in multi-tenant data centers. In this paper, we propose an algorithm to solve the placement of topology-oblivious SFC demands such that placed SFCs respect availability constraints imposed by the tenant. The algorithm leverages Fat-Tree properties to be computationally doable in an online manner. The simulation results show that it is able to satisfy as many demands as possible by spreading the load between the replicas and enhancing the network resources utilization

Demonstrating a unified ICN development and evaluation framework

Demo at ACM ICN conference 2014Information-Centric Networking solutions target world-wide deployment in the Internet. It is hence necessary to dispose of a development and evaluation environment which enables both controllable and realistic experimentation to thoroughly understand how ICN solutions would behave in real life deployment. In this demonstration, we present an ICN development and evaluation framework that combines emulation and live prototyping environments to provide ICN designers and implementers the means to build "beyond- prototype" ICN solutions. We will demonstrate the benefits of such integrated approach by showing how complete experimental studies can be carried out with minimum manual intervention and experiment setup overhead, in both emulation and live environments

RFC 9302 Locator/ID Separation Protocol (LISP) Map-Versioning

IETFThis document describes the Locator/ID Separation Protocol (LISP) Map-Versioning mechanism, which provides in-packet information about Endpoint-ID-to-Routing-Locator (EID-to-RLOC) mappings used to encapsulate LISP data packets. This approach is based on associating a version number to EID-to-RLOC mappings and transporting such a version number in the LISP-specific header of LISP-encapsulated packets. LISP Map-Versioning is particularly useful to inform communicating Ingress Tunnel Routers (ITRs) and Egress Tunnel Routers (ETRs) about modifications of the mappings used to encapsulate packets. The mechanism is optional and transparent to implementations not supporting this feature, since in the LISP-specific header and in the Map Records, bits used for Map-Versioning can be safely ignored by ITRs and ETRs that do not support or do not want to use the mechanism. This document obsoletes RFC 6834, which is the initial experimental specifications of the mechanisms updated by this document

An ns-3 distribution supporting MPTCP and MPEG-DASH obtained by merging community models

International audienceMPEG-DASH and MPTCP are two technologies growing in interest and put together they promise greater quality of experience for video consumers and better network resource usage. However, while independent MPEG-DASH and MPTCP implementations exist for ns-3, they are not directly usable together as they suffer from incompatibilities. In this work, we introduce a new ns-3 distribution that packages the AMuSt Framework DASH implementation and the ns-3 MPTCP implementation from University of Sussex such that they can be used together to nourish the flourishing research on Internet video streaming